Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Scheduling algorithm for periodic tasks with low energy consumption based on heterogeneous mult-core platforms
XIA Jun, YUAN Shuai, YANG Yi
Journal of Computer Applications    2019, 39 (10): 2980-2984.   DOI: 10.11772/j.issn.1001-9081.2019040665
Abstract274)      PDF (842KB)(234)       Save
Concerning at the high energy consumption of heterogeneous multi-core platforms, an algorithm for solving the optimal energy allocation scheme of periodic tasks by using optimization theory was proposed. The optimal energy consumption problem of periodic tasks was modeled and added constraints to the model. According to the optimization theory, the binary integer programming problem was relaxed to obtain the convex optimization problem. The interior point method was used to solve the optimization problem and the relaxed distribution matrix was obtained. The allocation scheme for partial tasks was obtained after the judgement processing of the decision matrix. On this basis, the iterative method was used to find the allocation scheme for the remaining tasks. Experimental results show that the energy consumption of this distribution scheme is reduced by about 1.4% compared with the similar optimization theory algorithm, and compared with the optimization theory algorithm with the similar energy consumption, the execution time of this scheme is reduced by 86%. At the same time, the energy consumption of the scheme is only 2.6% higher than the theoretically optimal energy consumption.
Reference | Related Articles | Metrics
Delaunay triangulation subdivision algorithm of spherical convex graph and its convergence analysis
XIA Jun, LI Yinghua
Journal of Computer Applications    2017, 37 (12): 3558-3562.   DOI: 10.11772/j.issn.1001-9081.2017.12.3558
Abstract419)      PDF (738KB)(511)       Save
When calculating curved Ricci Flow, non-convergence emerges due to the existence of undersized angles in triangular meshes. Concerning the problem of non-convergence, a Delaunay triangulation subdivision algorithm of spherical convex graph of enhancing the minimum angle was proposed. First of all, the Delaunay triangulation subdivision algorithm of spherical convex graph was given. The proposed algorithm had two key operations:1) if a Delaunay minor arc was "encroached upon", a midpoint of the Delaunay minor arc was added to segment the Delaunay minor arc; 2) if there was a "skinny" spherical triangle, it was disassembled by adding the center of minor circle of its circumscribed sphere. Then, the convergence criteria of the proposed algorithm was explored on local feature scale and an upper-bound formula of the output vertex was given. The grids based on the output of experiment show that the spherical triangle generated by the grids of the proposed algorithm has no narrow angle, so it is suitable for calculating Ricci Flow.
Reference | Related Articles | Metrics